Adaptive job routing and scheduling
نویسندگان
چکیده
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have begun proposing that computer systems be imbued with the ability to configure themselves, diagnose failures, and ultimately repair themselves in response to these failures. However, despite convincing arguments that such a shift would be desirable, as of yet there has been little concrete progress made towards this goal. We view these problems as fundamentally machine learning challenges. Hence, this article presents a new network simulator designed to study the application of machine learning methods from a system-wide perspective. We also introduce learning-based methods for addressing the problems of job routing and CPU scheduling in the networks we simulate. Our experimental results verify that methods using machine learning outperform reasonable heuristic and hand-coded approaches on example networks designed to capture many of the complexities that exist in real systems.
منابع مشابه
New Tabu Search Results for the Job Shop Scheduling Problem
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملTabu Search for the Flexible-Routing Job Shop Problem
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملPerformance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioning the arriving jobs into tasks that can be executed in parallel, assigning the tasks to processors and scheduling the task execution on each processor. In many system contexts jobs must depart in the order of their arrival, hence the resequence problem is involved. In this pap...
متن کاملReactive Search for Flexible Job Shop Scheduling
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملStatic Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particul...
متن کاملNew Routing Rules for Dynamic Flexible Job Shop Scheduling with Sequence-Dependent Setup Times
Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eng. Appl. of AI
دوره 17 شماره
صفحات -
تاریخ انتشار 2004